Go Set a Watchman - Dive Right In
نویسنده
چکیده
The literary world has been delirious with excitement since the announcement in February that a second novel by Harper Lee had been “found” and was to be published. To Kill a Mockingbird [3] was Harper Lee’s first (and until now only) novel published in 1960, winner of the 1961 Pulitzer Prize, and certainly one of the most beloved novels in American history. Having recently read Go Set a Watchman [4] which, at this writing, is #1 on the New York Times Bestsellers List, and, judging by our holds, it’s a very popular book (but don’t worry we have plenty of copies!), I will attempt to answer a few questions you may have.
منابع مشابه
Watchman routes for lines and line segments
Given a set L of non-parallel lines in the plane, a watchman route (tour) for L is a closed curve contained in the union of the lines in L such that every line is visited (intersected) by the route; we similarly define a watchman route (tour) for a connected set S of line segments. The watchman route problem for a given set of lines or line segments is to find a shortest watchman route for the ...
متن کاملWatchman routes in the presence of a pair of convex polygons
Given a set of polygonal obstacles in the plane, the shortest watchman route problem asks for a closed route from which each point in the exterior of the polygons is visible to some point along the route. This problem is known to be NP-hard and the development of an eecient approximation algorithm is still open. We present an O(n 2) time algorithm for computing the shortest watchman route for a...
متن کاملThe Polygon Exploration Problem
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed off-line. Our analysis is doubly founded on a novel geometric structure called the angle hull. Let D be a connected region inside a simple polygon, P . We define the angl...
متن کاملOptimum Guard Covers and m-Watchmen Routes for Restricted Polygons
A watchman, in the terminology of art galleries, is a mobile guard. We consider several watchman and guard problems for different classes of polygons. We introduce the notion of vision spans along a path (route) which provide a natural connection between the Art Gallery problem, the m-watchmen problem and the watchman route problem. We prove that finding the minimum number of vision points, i.e...
متن کاملMinimum-link watchman tours
We consider the problem of computing a watchman route in a polygon with holes. We show that the problem of finding a minimum-link watchman route is NP-complete, even if the holes are all convex. The proof is based on showing that the related problem of finding a minimum-link tour on a set of points in the plane is NP-complete. We provide a provably good approximation algorithm that achieves an ...
متن کامل